package hotLeetcode;

public class H206Leetcode {

    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode cur = head;
        while (cur != null) {
            ListNode temp = cur.next;
            cur.next = pre;
            pre = cur;
            cur = temp;

        }

        return cur;



    }


    public ListNode reverseList2(ListNode head) {
        ListNode newList = null;
        while (head != null) {
            newList = new ListNode(head.val, newList);
            head = head.next;
        }

        return newList;

    }


    public class ListNode {
        int val;
        ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, ListNode next) {
            this.val = val;
            this.next = next;
        }
    }

}
